Topological Self-similarity on the Random Binary-Tree Model
نویسندگان
چکیده
منابع مشابه
The abelian sandpile model on a random binary tree
We study the abelian sandpile model on a random binary tree. Using a transfer matrix approach introduced by Dhar & Majumdar, we prove exponential decay of correlations, and in a small supercritical region exponential decay of avalanche sizes. This shows a phase transition phenomenon between exponential decay and power law decay of avalanche sizes. Our main technical tools are: (1) A recursion f...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملSelf-similarity and Random Walks
This is an introductory level survey of some topics from a new branch of fractal analysis — the theory of self-similar groups. We discuss recent works on random walks on self-similar groups and their applications to the problem of amenability for these groups.
متن کاملRandom binary search tree with equal elements
We consider random binary search trees when the input consists of a multiset, i.e. a set with multiple occurrences of equal elements, and prove that the randomized insertion and deletion algorithms produce random search trees regardless of multiplicities; even if all the elements are equal during the tree updates, a search tree will maintain its randomness. Thus, equal elements do not degenerat...
متن کاملA Comparison of Random Binary Tree Generators
This paper empirically compares five linear-time algorithms for generating unbiased random binary trees. More specifically, we compare the relative asymptotic performance of the algorithms in terms of the numbers of various basic operations executed on average per tree node. Based on these numbers a ranking of the algorithms, which depends on the operation weights, can be deduced. A definitive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2010
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-010-9928-5